Short circuit covers for regular matroids with a nowhere zero 5-flow

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nowhere zero 4-flow in regular matroids

Jensen and Toft [10] conjectured that every 2-edge-connected graph without a K5minor has a nowhere zero 4-flow. Walton and Welsh [24] proved that if a coloopless regular matroid M does not have a minor in {M(K3,3),M(K5)}, then M admits a nowhere zero 4-flow. In this note, we prove that if a coloopless regular matroid M does not have a minor in {M(K5),M(K5)}, then M admits a nowhere zero 4-flow....

متن کامل

Nowhere-zero Flows in Regular Matroids and Hadwiger’s Conjecture

We present a tool that shows, that the existence of a k-nowhere-zero-flow is compatible with 1-,2and 3-sums in regular matroids. As application we present a conjecture for regular matroids that is equivalent to Hadwiger’s conjecture for graphs and Tuttes’s 4and 5-flow conjectures.

متن کامل

Circuit and fractional circuit covers of matroids

LetM be a connectedmatroid having a ground set E. Lemos andOxley proved that |E(M)| ≤ 2 c(M)c (M)where c(M) (resp. c(M)) is the circumference (resp. cocircumference) of M. In addition, they conjectured that one can find a collection of at most c(M) circuits which cover the elements ofM at least twice. In this paper, we verify this conjecture for regular matroids. Moreover, we show that a versio...

متن کامل

Nowhere-zero flow polynomials

In this article we introduce the flow polynomial of a digraph and use it to study nowherezero flows from a commutative algebraic perspective. Using Hilbert’s Nullstellensatz, we establish a relation between nowhere-zero flows and dual flows. For planar graphs this gives a relation between nowhere-zero flows and flows of their planar duals. It also yields an appealing proof that every bridgeless...

متن کامل

Nowhere-zero 5-flows

We prove that every cyclically 6-edge-connected cubic graph with oddness at most 4 has a nowhere-zero 5-flow. Therefore, a possible minimum counterexample to the 5-flow conjecture has oddness at least 6.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 1987

ISSN: 0095-8956

DOI: 10.1016/0095-8956(87)90011-6